منابع مشابه
Proving infinitary formulas
The infinitary propositional logic of here-and-there is important for the theory of answer set programming in view of its relation to strongly equivalent transformations of logic programs. We know a formal system axiomatizing this logic exists, but a proof in that system may include infinitely many formulas. In this note we describe a relationship between the validity of infinitary formulas in ...
متن کاملProving Infinitary Normalization
We investigate the notion of ‘infinitary strong normalization’ (SN∞), introduced in [6], the analogue of termination when rewriting infinite terms. A (possibly infinite) term is SN∞ if along every rewrite sequence each fixed position is rewritten only finitely often. In [9], SN∞ has been investigated as a system-wide property, i.e. SN∞ for all terms of a given rewrite system. This global proper...
متن کاملFinite Proofs for Infinitary Formulas
Recent work has shown that the infinitary logic of hereand-there is closely related to the input language of the ASP grounder gringo. A formal system axiomatizing that logic exists, but a proof in that system may include infinitely many formulas. In this note, we define a correspondence between the validity of infinitary formulas in the logic of here-and-there and the provability of formulas in...
متن کاملInfinitary Formulas in Answer Set Programming
The concept of a stable model for infinitary propositional formulas can be used to define the semantics of answer set programming languages. A semantics of this kind serves as a specification for the latest version of the answer set grounder GRINGO. The original definition of a stable model [Gelfond and Lifschitz, 1988] has been generalized in several ways (a survey by Lifschitz [2010] provides...
متن کاملA Model Existence Theorem for Infinitary Formulas in Metric Spaces
We prove a Model Existence Theorem for a fully infinitary logic LA for metric structures. This result is based on a generalization of the notions of approximate formulas and approximate truth in normed structures introduced by Henson ([7]) and studied in different forms by Anderson ([1]) and Fajardo and Keisler ([2]). This theorem extends Henson’s Compactness Theorem for approximate truth in no...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2016
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068416000302